On General Binary Relation Based Rough Set
نویسندگان
چکیده
To keep the key idea of rough set and the representation of information in rough set theory, empty representation is processed properly and three new forms of rough approximation sets are defined as a generation of general binary relation based rough set model. Moreover, the properties of approximation operators in these new rough sets are discussed. The relations among them are studied in this paper. In addition, examples are arranged to interpret what we studied in this paper.
منابع مشابه
Topological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملBinary Relation, Basis Algebra, Approximation Operator Form and Its Property in L-Fuzzy Rough Sets
The rough set theory usually is used in datamining. At this time, we will suppose the approximation operator to satisfy some wonderful properties. It need us to think about the basis algebra, the binary relation and the approximation operator’s form in the rough set model. Lfuzzy rough approximation operator is a general fuzzy rough approximation operator. Comparing with the others rough approx...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملThe Ordered Set of Rough Sets
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a complete Stone lattice. Furthermore, for the...
متن کاملApproximations in Rough Sets vs Granular Computing for Coverings
Rough set theory is an important technique in knowledge discovery in databases. Classical rough set theory proposed by Pawlak is based on equivalence relations, but many interesting and meaningful extensions have been made based on binary relations and coverings, respectively. This paper makes a comparison between covering rough sets and rough sets based on binary relations. This paper also foc...
متن کامل